Ring structures and mean first passage time in networks
نویسندگان
چکیده
منابع مشابه
Mean First Passage Time in Periodic Attractors
Abstract. The properties of the mean first passage time in a system characterized by multiple periodic attractors are studied. Using a transformation from a high dimensional space to 1D, the problem is reduced to a stochastic process along the path from the fixed point attractor to a saddle point located between two neighboring attractors. It is found that the time to switch between attractors ...
متن کاملFirst passage time distribution in heterogeneity controlled kinetics: going beyond the mean first passage time
The first passage is a generic concept for quantifying when a random quantity such as the position of a diffusing molecule or the value of a stock crosses a preset threshold (target) for the first time. The last decade saw an enlightening series of new results focusing mostly on the so-called mean and global first passage time (MFPT and GFPT, respectively) of such processes. Here we push the un...
متن کاملUniversal equivalence of mean first-passage time and Kramers rate.
We prove that for an arbitrary time-homogeneous stochastic process, Kramers's flux-over-population rate is identical to the inverse of the associated mean first-passage time. In this way the mean first-passage time problem can be treated without making use of the adjoint equation in conjunction with cumbersome boundary conditions.
متن کاملEstimating Mean First Passage Time of Biased Random Walks with Short Relaxation Time on Complex Networks
Biased random walk has been studied extensively over the past decade especially in the transport and communication networks communities. The mean first passage time (MFPT) of a biased random walk is an important performance indicator in those domains. While the fundamental matrix approach gives precise solution to MFPT, the computation is expensive and the solution lacks interpretability. Other...
متن کاملMean first-passage time for maximal-entropy random walks in complex networks
We perform an in-depth study for mean first-passage time (MFPT)--a primary quantity for random walks with numerous applications--of maximal-entropy random walks (MERW) performed in complex networks. For MERW in a general network, we derive an explicit expression of MFPT in terms of the eigenvalues and eigenvectors of the adjacency matrix associated with the network. For MERW in uncorrelated net...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2006
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.73.026103